import math
ta = int(input())
while ta:
ta -= 1
a = input()
coun = [0] * len(a)
for i in range(len(a)-2):
if a[i] == 'o' and a[i + 1] == 'n' and a[i + 2] == 'e':
coun[i] += 1
coun[i + 1] += 1
coun[i + 2] += 1
elif a[i] == 't' and a[i + 1] == 'w' and a[i + 2] == 'o':
coun[i] += 2
coun[i + 1] += 2
coun[i + 2] += 2
for i in range(2, len(a) - 2):
if coun[i] == 3:
coun[i - 1] = 0
coun[i - 2] = 0
coun[i + 1] = 0
coun[i + 2] = 0
ans = []
for i in range(len(a)):
if coun[i] == 3:
ans.append(i+1)
elif coun[i] == 2:
ans.append(i + 2)
coun[i] = 0
coun[i+1]=0
coun[i + 2] = 0
elif coun[i] == 1:
ans.append(i + 2)
coun[i] = 0
coun[i+1]=0
coun[i + 2] = 0
print(len(ans))
print(*ans)
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |